t=int(input())
for i in range(t):
w,h,n=map(int,input().split())
ans=1
while w%2==0:
w/=2
ans*=2
while h%2==0:
h/=2
ans*=2
if ans>=n:
print('Yes')
else:
print('No')#include <iostream>
using namespace std;
void solve() {
int w, h, n;
cin>>w>>h>>n;
int res = 1;
while (w%2 == 0) {
w /= 2;
res *= 2;
}
while (h % 2 == 0) {
h /= 2;
res *= 2;
}
cout << (res >= n ? "YES\n" : "NO\n");
}
int main()
{
int t;
cin>>t;
while(t--){
solve();
}
return 0;
}
13 Reasons Why | Friend's Relationship |
Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |
Lexical Sorting Reloaded | 1514A - Perfectly Imperfect Array |
580A- Kefa and First Steps | 1472B- Fair Division |